package leecode.mid;

import java.util.Arrays;

/**
 * @Author: xieZW
 * @Date: 2022/3/2 11:26
 * 数组中的第K个最大元素
 * 输入: [3,2,3,1,2,4,5,5,6] 和 k = 4
 * 32
 * 332
 * 3321
 * 33221
 * 332241
 * 3322451
 * 33224551
 * 332245561
 * 输出: 4
 */
public class Index215 {

    public int findKthLargest(int[] nums, int k) {

        //倒序排
        //找
        int temp = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            temp = nums[i];
            for (int j = 0; j < nums.length; j++) {
//                nums[i]
            }
        }

        Arrays.sort(nums);

        return 0;
    }
}
